Given a binary search tree and a node in it, find the in-order successor of that node in the BST. Note: If the given node has no in-order successor in the tree, return null. [Problem Link] If ‘P’ >= current Node, go right as the next node is in the right sub tree If ‘P’ … Continue reading [Programming Problem] Inorder Successor in BST